Node Aggregation in Vehicle Routing
نویسنده
چکیده
We describe a special variant of the Vehicle Routing Problem (VRP), where there are many customers per road segment. A metaheuristic tabu search algorithm for the VRP is given, and aggregation of customers is used to better the performance, with respect to both time and solution quality. The methods are tested on test instances from the literature as well as a portfolio of new test instances especially made to fit to the problem description. Test results are reported, showing that aggregation can lead to substantial improvements both in time and solution quality in this setting, especially for larger instances.
منابع مشابه
Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملNetwork Parameters Evaluation in Vehicular Ad-hoc Network (VANET) Routing Protocols for Efficient Message Delivery in City Environment
Abstract- Efficient message delivery in city environment is required to ensure driver’s safety and passenger’s comfortability. In cities of developed nations, routing of data in vehicular Ad hoc Network (VANET) faces many challenges such as radio obstacles, mobility constraints and uneven nodes distribution. These factors primarily makes communication between vehicles complex. To overcome and t...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملMultimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کامل